The complexity of admissible rules of Lukasiewicz logic
نویسندگان
چکیده
منابع مشابه
Admissible Rules of Lukasiewicz Logic
We investigate admissible rules of Lukasiewicz multi-valued propositional logic. We show that admissibility of multiple-conclusion rules in Lukasiewicz logic, as well as validity of universal sentences in free MV -algebras, is decidable (in PSPACE ).
متن کاملThe complexity of admissible rules of Lukasiewicz logic
We investigate the computational complexity of admissibility of inference rules in infinite-valued Lukasiewicz propositional logic ( L). It was shown in [13] that admissibility in L is checkable in PSPACE. We establish that this result is optimal, i.e., admissible rules of L are PSPACE-complete. In contrast, derivable rules of L are known to be coNP-complete.
متن کاملBases of Admissible Rules of Lukasiewicz Logic
We construct explicit bases of single-conclusion and multiple-conclusion admissible rules of propositional Lukasiewicz logic, and we prove that every formula has an admissibly saturated approximation. We also show that Lukasiewicz logic has no finite basis of admissible rules.
متن کاملComplexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition under which the admissibility problem is coNEXP -hard. We also show that admissibility in several well-known systems (including GL, S4, and IPC ) is in coNE , thus obtaining a sharp complexity estimate for admissibility in...
متن کاملThe Complexity of 3-Valued Lukasiewicz Rules
It is known that determining the satisfiability of n-valued ?ukasiewicz rules is NP-complete for n?4, as well as that it can be solved in time linear in the length of the formula in the Boolean case (when n=2). However, the complexity for n=3 is an open problem. In this paper we formally prove that the satisfiability problem for 3-valued ?ukasiewicz rules is NP-complete. Moreover, we also prove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2012
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exs007